Node Synchronization for the Viterbi Decoder
نویسندگان
چکیده
منابع مشابه
Node Synchronization for the Viterbi Decoder
Motivated by the needs of NASA’s Voyager 2 mission, in this paper we describe an algorithm which detects and corrects losses of node synchronization in convolutionally encoded data. This algorithm, which would be implemented as a hardware device external to a Viterbi decoder, makes statistical decisions shout node synch based on the hard-quantized undecoded data stream. ,We will show that in a ...
متن کاملReconfigurable Viterbi Decoder
Forward Error Correction (FEC) schemes are an essential component of wireless communication systems. Convolutional codes are employed to implement FEC but the complexity of corresponding decoders increases exponentially according to the constraint length. Present wireless standards such as Third generation (3G) systems, GSM, 802.11A, 802.16 utilize some configuration of convolutional coding. Co...
متن کاملNode Synchronization of Viterbi Decoders Using State Metrics
This article investigates the concept of node synchronization using state metrics. In this study, the branch metn'cs are integrated over a fixed time interval and the results are compared to the detection threshold. If the threshold is exceeded, the out-of-sync hypothesis is accepted; otherwise, the in-sync hypothesis is accepted. It is shown that the detection threshold can be chosen independe...
متن کاملMIT 6.375 Project Viterbi Decoder
The use of forward error correction (FEC) technique is known to be an e ective way to increase the reliability of the digital communication and to improve the capacity of a channel. Convolutional encoder at the transmitter associated with the Viterbi decoder at the receiver has been a predominant FEC technique because of its high e ciency and robustness. However, the Viterbi decoder consumes la...
متن کاملCMOS Implementation of Viterbi Decoder
This paper presents implementation of a soft decision Viterbi decoder suitable for convolution codes with short constraint lengths. The decoder is based on a property of Viterbi algorithm that states “if the survivor paths from all possible states at time n are traced back then with high probability all the paths merge at time n-L where L is the survivor path length”. Pipeline structures are in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 1984
ISSN: 0090-6778
DOI: 10.1109/tcom.1984.1096098